The Gradient Discretisation Method for Linear Advection Problems
نویسندگان
چکیده
منابع مشابه
A Discretisation Method for Solving Time Optimal Control Problems
Abstract: Classical methods are mostly deficient for solving nonlinear time optimal control problems. In this paper an approach to solve this kind of problems is considered. This method was first presented by Badakhshan et al. in [1] and in this paper, this method is expanded to solve time optimal control problems. In this approach the time optimal control problem is changed to a problem in cal...
متن کاملDefuzzification Method for Solving Fuzzy Linear Programming Problems
Several authors have proposed different methods to find the solution of fully fuzzy linear programming (FFLP) problems. But all the existing methods are based on the assumption that all the fuzzy coefficients and the fuzzy variables are non-negative fuzzy numbers. in this paper a new method is proposed to solve an FFLP problems with arbitrary fuzzy coefficients and arbitrary fuzzy variables, th...
متن کاملPseudo-Spectral Methods for Linear Advection and Dispersive Problems
The most important feature of numerical methods based on a spectral decomposition is the best convergence rate (even infinite for infinitely regular functions) with respect to all other methods used in dealing with the solution to most of the differential equations. However this is true under the mandatory condition that at each time step of the evolving numerical solution no discontinuity occu...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملA NOTE ON THE ZIMMERMANN METHOD FOR SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS
There are several methods for solving fuzzy linear programming (FLP)problems. When the constraints and/or the objective function are fuzzy, the methodsproposed by Zimmermann, Verdegay, Chanas and Werners are used more often thanthe others. In the Zimmerman method (ZM) the main objective function cx is addedto the constraints as a fuzzy goal and the corresponding linear programming (LP)problem w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Methods in Applied Mathematics
سال: 2019
ISSN: 1609-4840,1609-9389
DOI: 10.1515/cmam-2019-0060